On the existence of super edge-connected graphs with prescribed degrees
نویسندگان
چکیده
منابع مشابه
On the existence of super edge-connected graphs with prescribed degrees
Let G be a connected graph of order n, minimum degree δ(G), and edge-connectivity κ (G). The graph G ismaximally edge-connected if κ (G) = δ(G) and super edge-connected if every minimum edge-cut consists of edges incident with a vertex of minimum degree. A list (d1, . . . , dn) is graphic if there is a graph with vertices v1, . . . , vn such that d(vi) = di for 1 ≤ i ≤ n. A graphic list D is su...
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملFast generation of random connected graphs with prescribed degrees
We address here the problem of generating random graphs uniformly from the set of simple connected graphs having a prescribed degree sequence. Our goal is to provide an algorithm designed for practical use both because of its ability to generate very large graphs (efficiency) and because it is easy to implement (simplicity). We focus on a family of heuristics for which we prove optimality condi...
متن کاملmaximally edge - connected and super - edge - connected graphs ∗
Let G be a connected graph with minimum degree δ and edgeconnectivity λ. A graph is maximally edge-connected if λ = δ, and it is superedge-connected if every minimum edge-cut is trivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree. In this paper, we show that a connected graph or a connected triangle-free graph is maximally edge-connected or sup...
متن کاملVulnerability of super edge-connected graphs
A subset F of edges in a connected graph G is a h-extra edge-cut if G − F is disconnected and every component has more than h vertices. The h-extra edge-connectivity λ(G) of G is defined as the minimum cardinality over all h-extra edge-cuts of G. A graph G, if λ(G) exists, is super-λ if every minimum h-extra edge-cut of G isolates at least one connected subgraph of order h + 1. The persistence ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2014
ISSN: 0012-365X
DOI: 10.1016/j.disc.2014.03.025